Packing up to 50 Equal Circles in a Square

نویسندگان

  • Kari J. Nurmela
  • Patric R. J. Östergård
چکیده

The Hungarian mathematician Farkas Bolyai (1775–1856) published in his principal work (‘Tentamen’, 1832–33 [Bol04]) a dense regular packing of equal circles in an equilateral triangle (see Fig. 1). He defined an infinite packing series and investigated the limit of vacuitas (in Latin, the gap in the triangle outside the circles). It is interesting that these packings are not always optimal in spite of the fact that they are based on hexagonal grid packings. Bolyai probably was the first author in the mathematical literature who studied the density of a series of packing circles in a bounded shape.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Packing Equal Circles in a Square: I. Solution Properties

In this paper some properties of optimal solutions for the problem of packing n equal circles into the unit square will be derived. In particular, properties, which must be satissed by at least one optimal solution of the problem and stating the intuitive fact that as many circles as possible should touch the boundary of the unit square, will be introduced.

متن کامل

A better packing of ten equal circles in a square

Let S be a square of side s in the Euclidean plane. A pucking of circles in S is nothing else but a finite family of circular disks included in S whose interiors are pairwise disjoints. A natural problem related with such packings is the description of the densest ones; in particular, what is the greatest value of the common radius r of n circles forming a packing of S? Clearly, the centres of ...

متن کامل

Global Optimization in Geometry — Circle Packing into the Square

The present review paper summarizes the research work done mostly by the authors on packing equal circles in the unit square in the last years.

متن کامل

Symmetry Breaking Constraints for the Problem of Packing Equal Circles in a Square

The Packing Equal Circles in a Square (PECS) problem is a nonconvex nonlinear optimization problem which involves a high degree of symmetry. The Branch-and-Bound algorithms work bad due to the presence of symmetric optima, because the Branch-and-Bound tree becomes large, and the time to reach the leaves (i.e., the optimal solutions) increases. In this paper, we introduce some inequalities which...

متن کامل

Static Symmetry Breaking in Circle Packing

We present new Static Symmetry-Breaking Inequalities (SSBI) [11,6] for the problem of packing equal circles in a square [9]. The new SSBIs provide a marked computational improvement with respect to past work [1], though not yet at the level where a purely Mathematical Programming (MP) based spatial Branch-and-Bound (sBB) can be competitive with a Branch-and-Bound (BB) “boosted” by combinatorial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1997